The Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order
نویسنده
چکیده
The directed anti-Oberwolfach problem asks for a 2-factorization (each factor has in-degree 1 and out-degree 1 for a total degree of two) of K2n+1, not with consistent cycle components in each 2-factor like the Oberwolfach problem, but such that every admissible cycle size appears at least once in some 2-factor. The solution takes advantage of both Piotrowski’s decomposition techniques used to solve Oberwolfach problems and the techniques used by the author to solve the undirected anti-Oberwolfach problem.
منابع مشابه
Regular Oberwolfach Problems and Group Sequencings
We deal with Oberwolfach factorizations of the complete graphs Kn and K n *, which admit a regular group of automorphisms. We show that the existence of such a factorization is equivalent to the existence of a certain difference sequence defined on the elements of the automorphism group, or to a certain sequencing of the elements of that group. In the particular case of a hamiltonian factorizat...
متن کاملOn bipartite 2-factorizations of kn - I and the Oberwolfach problem
It is shown that if F1, F2, . . . , Ft are bipartite 2-regular graphs of order n and α1, α2, . . . , αt are non-negative integers such that α1+α2+· · ·+αt = n−2 2 , α1 ≥ 3 is odd, and αi is even for i = 2, 3, . . . , t, then there exists a 2-factorisation of Kn−I in which there are exactly αi 2-factors isomorphic to Fi for i = 1, 2, . . . , t. This result completes the solution of the Oberwolfa...
متن کاملOn the Directed Oberwolfach Problem with Equal Cycle Lengths
We examine the necessary and sufficient conditions for a complete symmetric digraph K n to admit a resolvable decomposition into directed cycles of length m. We give a complete solution for even m, and a partial solution for odd m.
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملTwo-factorizations of Small Complete Graphs Ii: the Case of 13 Vertices
We establish that for each of the 5005 possible types of 2factorizations of the complete graph K13, there exists at least one solution. We also enumerate all nonisomorphic solutions to the Oberwolfach problem
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 9 شماره
صفحات -
تاریخ انتشار 2002